Prioritizing Bellman Backups without a Priority Queue
نویسندگان
چکیده
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of Bellman backups to focus computation on states where the value function can be improved the most. In previous work, a priority queue has been used to order backups. Although this incurs overhead for maintaining the priority queue, previous work has argued that the overhead is usually much less than the benefit from prioritization. However this conclusion is usually based on a comparison to a non-prioritized approach that performs Bellman backups on states in an arbitrary order. In this paper, we show that the overhead for maintaining the priority queue can be greater than the benefit, when it is compared to very simple heuristics for prioritizing backups that do not require a priority queue. Although the order of backups induced by our simple approach is often sub-optimal, we show that its smaller overhead allows it to converge faster than other state-of-the-art priority-based solvers.
منابع مشابه
On the value function of a priority queue with an application to a controlled polling model
We give a closed-form expression for the discounted weighted queue length and switching costs of a two-class single-server queueing model under a preemptive priority rule. These expressions are used to do a single step of policy iteration in a polling model with a dynamically controlled switching rule, starting from the preemptive priority rule. Numerical experiments show that this leads to a p...
متن کاملAn ATM Queue Manager with Multiple Delay and Loss Priorities
The asynchronous transfer mode (ATM) technique provides a flexible and effective scheme to transport traffic generated by a variety of services with different quality of service (QOS) requirements. To fully utilize network resources while still providing satisfactory QOS to all network users, prioritizing different traffic according to their service requirement becomes necessary. During the cal...
متن کاملOn the Transient and Steady-State Analysis of a Special Single Server Queuing System with HOL Priority Scheduling
In this paper, we consider a special discrete-time queuing system with two head-of-line (HOL) priority queues and a mix of correlated and uncorrelated arrivals. The arrival process to the high priority queue is correlated and consists of a train of a fixed number of fixed-length packets, while the low priority traffic consists of batch arrivals that are independent and identically distributed f...
متن کاملAppointments in Care Pathways: the Geo/D/1 Queue with Slot Reservations
Motivated by the increasing popularity of care pathways in outpatient clinics, where some patients complete a significant part of the path in one day, hospitals aim to optimize the flow of these patients by prioritizing them in the appointment planning process. This paper considers the Geo/D/1 queue with slot reservations that serves regular patients and priority patients. Priority patients res...
متن کاملAppointments in care pathways: the Geox/D/1 queue with slot reservations
Motivated by the increasing popularity of care pathways in outpatient clinics, where some patients complete a significant part of the path in one day, hospitals aim to optimize the flow of these patients by prioritizing them in the appointment planning process. This paper considers the Geox/D/1 queue with slot reservations that serves regular patients and priority patients. Priority patients re...
متن کامل